An Ore-type sufficient condition for a bipancyclic ordering

Hendry, G.R.T., An Ore-type sufficient condition for a bipancyclic ordering, Discrete Mathematics 102 (1992) 47-49. It is shown that if G(X, Y, E) is a bipartite graph with 1X1= IYI = n Z= 2 in which d(x) + d(y) 2 n + 1 whenever x E X, y E Y, and xy $ E then, unless n is odd and G is one exceptional graph, G has a bipancyclic ordering, i.e. the vertices of X and Y can be labelled x,, . , x, and y ,,..., y,,respectively,sothatC,,~(x, ,..., x,,y ,,..., y,),for2n+l. (1) 0012-365X/92/$05.00